Vector Ordinal Optimization
نویسندگان
چکیده
Ordinal Optimization is a tool to reduce the computational burden in simulation-based optimization problems. The major effort in this field so far focuses on single-objective optimization. In this paper we extend this to multi-objective optimization, and develop Vector Ordinal Optimization, which is different from the one introduced in Ref. 1. Alignment probability and ordered performance curve (OPC) are redefined for multi-objective optimization. Our results led to quantifiable subset selection sizes in multi-objective case, which supplies guidance in solving practical problems, as demonstrated by examples in this paper.
منابع مشابه
Support Vector Ordinal Regression
In this letter, we propose two new support vector approaches for ordinal regression, which optimize multiple thresholds to define parallel discriminant hyperplanes for the ordinal scales. Both approaches guarantee that the thresholds are properly ordered at the optimal solution. The size of these optimization problems is linear in the number of training samples. The sequential minimal optimizat...
متن کاملMulti-Objective Service Composition with QoS Dependencies
Service composition is popular for composing a set of existing services to provide complex services. With the increasing number of services deployed in cloud computing environments, many service providers have started to offer candidate services with equivalent functionality but different Quality of Service (QoS) levels. Therefore, QoS-aware service composition has drawn extensive attention. Mo...
متن کاملSeparable convex optimization with nested lower and upper constraints
We study a convex resource allocation problem in which lower and upper bounds are imposed on partial sums of allocations. This model is linked to a large range of applications, including production planning, speed optimization, stratified sampling, support vector machines, portfolio management, and telecommunications. We propose an efficient gradient-free divide-and-conquer algorithm, which use...
متن کاملOn Universum - Support Vector Machines ∗
Universum-support vector machine (U-SVM) is an elegant method for 2-class classification problem. It is systematically studied in this paper, including the existence and uniqueness of the primal problem as well as the relation between the solutions of primal problem and dual problem. We find that U-SVM uses 3-class classification approach to solve the 2-class classification problem. So we have ...
متن کاملISAC – Instance - Specific Algorithm Configuration 1
We present a new method for instance-specific algorithm configuration (ISAC). It is based on the integration of the algorithm configuration system GGA and the recently proposed stochastic offline programming paradigm. ISAC is provided a solver with categorical, ordinal, and/or continuous parameters, a training benchmark set of input instances for that solver, and an algorithm that computes a fe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004